Reals which compute little
نویسندگان
چکیده
We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively approximated in a sense to be specified. We investigate those properties, in particular showing that super-lowness and jump-traceability coincide within the r.e. sets but none of the properties implies the other within the ω-r.e. sets. Finally we prove that, for any low r.e. set B, there is is a K-trivial set A 6≤T B.
منابع مشابه
Reals which Compute Little André
We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively approximated in a sense to be specified. We investigate those properties, in particular showing that super-lowness and jump-traceability coincide within the r.e. sets but none of the properties implies the o...
متن کاملRelative (non-)formality of the Little Cubes Operads and the Algebraic Cerf Lemma
It is shown that the operad maps En → En+k are formal over the reals for k ≥ 2 and non-formal for k = 1. Furthermore we compute the homology of the deformation complex of the operad maps En → En+1, proving an algebraic version of the Cerf lemma.
متن کامل1 5 A pr 1 99 8 Ordinal Computers
Can a computer which runs for time ω 2 compute more than one which runs for time ω? No. Not, at least, for the infinite computer we describe. Our computer gets more powerful when the set of its steps gets larger. We prove that they theory of second order arithmetic cannot be decided by computers running to countable time. Our motivation is to build a computer that will store and manipulate surr...
متن کاملBüchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order
This work considers weak deterministic Büchi automata reading encodings of non-negative reals in a fixed base. A Real Number Automaton is an automaton which recognizes all encoding of elements of a set of reals. It is explained how to decide in linear time whether a set of reals recognized by a given minimal weak deterministic RNA is FO [R; +, <, 1]definable. Furthermore, it is explained how to...
متن کاملDegrees of Weakly Computable Reals
A real α is left-recursively enumerable (left-r.e. for short) if we can effectively generate α from below. That is, the left Dedkind cut of α, L(α) = {q ∈ Q : q ≤ α}, forms a r.e. set. Equivalently, a real α is left-r.e. if it is the limit of a converging recursive increasing sequence. If we can also compute the radius of convergence effectively, then α is recursive. Left-r.e. reals are the mea...
متن کامل